5 research outputs found

    Assessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation

    No full text
    Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this paper is to assess the possible substitution of the geodesic metric with the Log-Euclidean one to reduce the computational cost of a statistical surface evolution algorithm. Materials and Methods: We incorporated the Log-Euclidean metric in the statistical surface evolution algorithm framework. To achieve this goal, the statistics and gradients of diffusion tensor images were defined using the Log-Euclidean metric. Numerical implementation of the segmentation algorithm was performed in the MATLAB software using the finite difference techniques. Results: In the statistical surface evolution framework, the Log-Euclidean metric was able to discriminate the torus and helix patterns in synthesis datasets and rat spinal cords in biological phantom datasets from the background better than the Euclidean and J-divergence metrics. In addition, similar results were obtained with the geodesic metric. However, the main advantage of the Log-Euclidean metric over the geodesic metric was the dramatic reduction of computational cost of the segmentation algorithm, at least by 70 times. Discussion and Conclusion: The qualitative and quantitative results have shown that the Log-Euclidean metric is a good substitute for the geodesic metric when using a statistical surface evolution algorithm in DTIs segmentation

    Mathematical modeling of hypoxia and adenosine to explore tumor escape mechanisms in DC-based immunotherapy

    No full text
    Abstract Identifying and controlling tumor escape mechanisms is crucial for improving cancer treatment effectiveness. Experimental studies reveal tumor hypoxia and adenosine as significant contributors to such mechanisms. Hypoxia exacerbates adenosine levels in the tumor microenvironment. Combining inhibition of these factors with dendritic cell (DC)-based immunotherapy promises improved clinical outcomes. However, challenges include understanding dynamics, optimal vaccine dosages, and timing. Mathematical models, including agent-based, diffusion, and ordinary differential equations, address these challenges. Here, we employ these models for the first time to elucidate how hypoxia and adenosine facilitate tumor escape in DC-based immunotherapy. After parameter estimation using experimental data, we optimize vaccination protocols to minimize tumor growth. Sensitivity analysis highlights adenosine’s significant impact on immunotherapy efficacy. Its suppressive role impedes treatment success, but inhibiting adenosine could enhance therapy, as suggested by the model. Our findings shed light on hypoxia and adenosine-mediated tumor escape mechanisms, informing future treatment strategies. Additionally, identifiability analysis confirms accurate parameter determination using experimental data

    ADC-assisted random sampler architecture for efficient sparse signal acquisition

    No full text
    Abstract A method for sampling Fourier sparse signals for efficient implementation of analog-to-information converters is proposed. The solution reconstructs Nyquist rate high-resolution signal from Nyquist rate low-resolution and sub-Nyquist rate high-resolution samples. For implementation, an architecture based on customized reconfigurable successive approximation register analog-to-digital converter is proposed, simulated, and demonstrated. The power consumption with a 90-nm CMOS process is less than 26 μW with 1-Msample/s rate in reconfigurable 3/10-bit mode. The number of floating point operations per second needed for signal recovery is less than 2% required by the orthogonal matching pursuit algorithm. The functionality of the solution has been verified with an experimental system
    corecore